The decompositional approach to matrix computation
نویسنده
چکیده
11 1951, Paul S. Dwyer pnblishcd I,inenr Comptntions, perhaps the first hook dcvoted cntirely to numerical linear algebra.' Digital conipiiting was in its infancy, and Dwyer focused on computation with tncchanical calculators. Nonctheless, the hook was state of the art. Figurc 1 reproduces a pagc of thc book dealing with Gaussian elimination. In 1954, Alston S. Householder published Prim+ p b nf Nzc"cn1 Ann1ysi.r; one of the first modcrn treatments of high-spccd digital coinputation. Figure 2 rcproduccs a page from this hook, also dealing with Gaussian elimiiiation. The contrast between tlicse two pages is striking. l'he most obvious difference is that Ilwyer
منابع مشابه
A Projected Alternating Least square Approach for Computation of Nonnegative Matrix Factorization
Nonnegative matrix factorization (NMF) is a common method in data mining that have been used in different applications as a dimension reduction, classification or clustering method. Methods in alternating least square (ALS) approach usually used to solve this non-convex minimization problem. At each step of ALS algorithms two convex least square problems should be solved, which causes high com...
متن کاملDecompositional Calculation of Operating Guidelines Using Free Choice Conflicts
An operating guideline (OG) for a service S finitely characterizes the (possibly infinite) set of all services that can interact with S without deadlocks. This paper presents a decompositional approach to calculate an OG for a service whose underlying structure is acyclic and contains free-choice conflicts. This divide-and-conquer approach promises to be more efficient than the classical OG com...
متن کاملA Block-Wise random sampling approach: Compressed sensing problem
The focus of this paper is to consider the compressed sensing problem. It is stated that the compressed sensing theory, under certain conditions, helps relax the Nyquist sampling theory and takes smaller samples. One of the important tasks in this theory is to carefully design measurement matrix (sampling operator). Most existing methods in the literature attempt to optimize a randomly initiali...
متن کاملFast Finite Element Method Using Multi-Step Mesh Process
This paper introduces a new method for accelerating current sluggish FEM and improving memory demand in FEM problems with high node resolution or bulky structures. Like most of the numerical methods, FEM results to a matrix equation which normally has huge dimension. Breaking the main matrix equation into several smaller size matrices, the solving procedure can be accelerated. For implementing ...
متن کاملDecompositional Construction of Lyapunov Functions for Hybrid Systems
In this paper, we present an automatable decompositional method for the computation of Lyapunov functions for hybrid systems with complex discrete state spaces. We use graph-based reasoning to decompose hybrid automata into subgraphs, for which we then solve semidefinite optimization problems to obtain local Lyapunov functions. These local computations are made in a way that ensures that the fa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computing in Science and Engineering
دوره 2 شماره
صفحات -
تاریخ انتشار 2000